OMReasoner: combination of multi-matchers for ontology matching: results for OAEI 2014

نویسندگان

  • Guohua Shen
  • Yinling Liu
  • Fei Wang
  • Jia Si
  • Zi Wang
  • Zhiqiu Huang
  • Dazhou Kang
چکیده

Ontology matching produces correspondences between entities of two ontologies. The OMReasoner is unique in that it creates an extensible framework for combination of multiple individual matchers, and reasons about ontology matching by using external dictionary WordNet and description logic reasoner. It handles ontology matching in both literal and semantic level, and it makes use of the semantic part of OWL-DL as well as structure. This paper describes the result of OMReasoner in the OAEI 2014 competition in three tracks: benchmark, conference, and MultiFarm. 1 Presentation of the system Ontology matching finds correspondences between semantically related entities of the ontologies. It plays a significant role in many application domains. Many approaches to ontology matching have been proposed: the implementation of match may use multiple match algorithms or matchers, and the following largelyorthogonal classification criteria are considered [1-3]: schema-level and instance-level, element-level and structure-level, syntactic and semantic, language-based and constraint-based. Many approaches focus on syntactic aspects instead of semantic ones. OMReasoner achieves the matching by means of some external dictionary and reasoning techniques. Still, this approach includes strategy of combination of (mainly syntactical) multi-matchers (e.g., EditDistance matcher) before match reasoning. 1.1 State, purpose, general statement The matching process can be defined as a function f. A’=f(O1, O2, A, p, r) Where O1 and O2 are a pair of ontologies as input to match, A is the input alignment between these ontologies and A’ is new alignment returned, p is a set of parameters (e.g., weight w and threshold τ) and r is a set of oracles and resources. Alignments express correspondences between two entities. A correspondence must express two corresponding entities and the relation that is supposed to hold between them. Given two ontologies, a correspondence is a 5-tuple:, where . id is a unique identifier of the given correspondence; . e1 and e2 are the entities of the first and the second ontology respectively; . R is a relation (e.g., equivalence(=), more general(>), less general(<), disjointness  )) holding between e1 and e2. In OAEI campaign, equivalence is mainly considered; . n is a confidence measure (typically in the [0 1] range) for the correspondence between e1 and e2. C1’,C2’, R1’,R2’ p ( w,τ) r dictionary

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OMReasoner: using multi-matchers and reasoner for ontology matching: results for OAEI 2012

Ontology matching produces correspondences between entities of two ontologies. The OMReasoner is unique in that it creates an extensible framework for combination of multiple individual matchers, and reasons about ontology matching by using description logic reasoner. It handles ontology matching in semantic level and makes full use of the semantic part of OWL-DL instead of structure. This pape...

متن کامل

OMReasoner: using reasoner for ontology matching: results for OAEI 2011

Ontology matching produces correspondences between entities of two ontologies. The OMReasoner is unique in that it creates an extensible framework for combination of multiple individual matchers, and reasons about ontology matching by using description logic reasoner. It handles ontology matching in semantic level and makes full use of the semantic part of OWL-DL instead of structure. This pape...

متن کامل

Towards combining ontology matchers via anomaly detection

In ontology alignment, there is no single best performing matching algorithm for every matching problem. Thus, most modern matching systems combine several base matchers and aggregate their results into a final alignment. This combination is often based on simple voting or averaging, or uses existing matching problems for learning a combination policy in a supervised setting. In this paper, we ...

متن کامل

Mix'n'Match: iteratively combining ontology matchers in an anytime fashion

We present a novel architecture for combining off-the-shelf ontology matchers based on iterative calls and exchanging information in the form of reference alignments. Unfortunately though, only a few of the matchers contesting in the past years’ OAEI campaigns actually allow the provision of reference alignments in the standard OAEI alignment format to support such a combined matching process. ...

متن کامل

CroMatcher results for OAEI 2016

Ontology matching plays an important role in the integration of heterogeneous data sources that are described by ontologies. In order to find correspondences between entities of different ontologies, a matching system has to be built. CroMatcher is an ontology matching system that consists of several string and structural basic matchers. As individual basic matcher computes similarity between e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014